Information Flow Control Revisited: Noninfluence = Noninterference + Nonleakage
نویسنده
چکیده
We revisit the classical notion of noninterference for statebased systems, as presented by Rushby in 1992. We strengthen his results in several ways, in particular clarifying the impact of transitive vs. intransitive policies on unwinding. Inspired partially by Mantel’s observations on unwinding for event systems, we remove the restriction on the unwinding relation to be an equivalence and obtain new insights in the connection between unwinding relations and observational preorders. Moreover, we make two major extensions. Firstly, we introduce the new notion of nonleakage, which complements noninterference by focusing not on the observability of actions but the information flow during system runs, and then combine it with noninterference, calling the result noninfluence. Secondly, we generalize all the results to (possibilistic) nondeterminism, introducing the notions of uniform step consistency and uniform local respect. Finally, we share our experience using nonleakage to analyze the confidentiality properties of the Infineon SLE66 chip. Like Rushby’s, our theory has been developed and checked using a theorem prover, so there is maximal confidence in its rigor and correctness.
منابع مشابه
Opacity - Further Insights on an Information Flow Property
In [1], [2], [3] Bryans et al define a security property known as opacity. In this paper, we investigate possible relationships between opacity and several existing definitions for information flow, namely noninterference [8], [9], non-inference [15], nondeducibility [20] and nonleakage [21]. We show that non-interference implies opacity, and that non-inference is equivalent to opacity. We also...
متن کاملUnwinding Conditional Noninterference
Noninterference provides a control over information flow in a system for ensuring confidentiality and integrity properties. In the literature this notion has been well studied as transitive noninterference and intransitive noninterference. In this paper we define a framework on the notion of conditional noninterference, which allows to specify information flow policies based on the semantics of...
متن کاملSlicing Guarantees Information Flow Noninterference
In this contribution, we show how correctness proofs for intra[8] and interprocedural slicing [9] can be used to prove that slicing is able to guarantee information flow noninterference. Moreover, we also illustrate how to lift the control flow graphs of the respective frameworks such that they fulfil the additional assumptions needed in the noninterference proofs. A detailed description of the...
متن کاملNotes on Information Flow Control
The goal of information flow control is to enforce IF policies associated with variables in a program. Assume there is a mapping Γ from variables to labels, which represent desired IF policies. The enforcement mechanism should ensure that a program and the accompanied mapping Γ satisfy noninterference. For these notes, we consider the following definition of noninterference for confidentiality:...
متن کاملInformation Flow and Concurrent Imperative Languages
Information flow for concurrent imperative languages is defined and studied. As a working formalism we use UNITY, where programs consist of sets of assignments executed randomly, i.e. without control flow. We study noninterference for programs which reach and do not reach fixed point a state which is not changed by a subsequent execution. We present logic formulation of noninterference as well ...
متن کامل